Limit behavior of maxima in geometric words representing set partitions
نویسندگان
چکیده
منابع مشابه
Limit Behavior of Maxima in Geometric Words representing Set Partitions
We consider geometric words ω1 · · ·ωn with letters satisfying the restricted growth property ωk ≤ d + max{ω0, . . . , ωk−1}, where ω0 := 0 and d ≥ 1. For d = 1 these words are in 1-to-1 correspondence with set partitions and for this case we show that the number of left-to-right maxima (suitable centered) does not converge to a fixed limit law as n tends to infinity. This becomes wrong for d ≥...
متن کاملSet partitions as geometric words
Using an analytic method, we derive an alternative formula for the probability that a geometrically distributed word of length n possesses the restricted growth property. Equating our result with a previously known formula yields an algebraic identity involving alternating sums of binomial coefficients via a probabilistic argument. In addition, we consider refinements of our formula obtained by...
متن کاملOn the Density of Languages Representing Finite Set Partitions
We present a family of regular languages representing partitions of a set of n elements in less or equal c parts. The density of those languages is given by partial sums of Stirling numbers of second kind for which we obtain explicit formulas. We also determine the limit frequency of those languages. This work was motivated by computational representations of the configurations of some numerica...
متن کاملSet partitions, words, and approximate counting with black holes
Words satisfying the restricted growth property wk ≤ 1 + max{w0, . . . , wk−1} are in correspondence with set partitions. Underlying the geometric distribution to the letters, these words are enumerated with respect to the largest letter occurring, which corresponds to the number of blocks in the set partition. It turns out that on average, this parameter behaves like log1/q n, where q is the p...
متن کاملRepresenting Partitions on Trees
In evolutionary biology, biologists often face the problem of constructing a phylogenetic tree on a set X of species from a multiset Π of partitions corresponding to various attributes of these species. One approach that is used to solve this problem is to try instead to associate a tree (or even a network) to the multiset ΣΠ consisting of all those bipartitions {A,X − A} with A a part of some ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicable Analysis and Discrete Mathematics
سال: 2015
ISSN: 1452-8630,2406-100X
DOI: 10.2298/aadm150619013f